Algorithmic reducibilities of algebraic structures
نویسنده
چکیده
Using admissibility for a computable model theory for uncountable structures
منابع مشابه
Many-one reductions and the category of multivalued functions
Many-one reductions between search problems (i.e. multi-valued functions) play a crucial part in both algorithmic game theory (via classes such as PLS or PPAD) and the study of incomputability in analysis. While the formal setting differs significantly, the present papers offers a unifying approach in terms of category theory that allows to deduce that any degree structure arising from such red...
متن کاملEffective Reducibilities on Structures and Degrees of Presentability
In this survey paper we consider presentations of structures in admissible sets and some effective reducibilities between structures and their degrees of presentability. Degrees of Σ-definability of structures, as well as degrees of presentability with respect to different effective reducibilities, are natural measures of complexity which are total, i.e. defined for any structure. We also consi...
متن کاملBaire reductions and good Borel reducibilities
In [8] we have considered a wide class of “well-behaved” reducibilities for sets of reals. In this paper we continue with the study of Borel reducibilities by proving a dichotomy theorem for the degree-structures induced by good Borel reducibilities. This extends and improves the results of [8] allowing to deal with a larger class of notions of reduction (including, among others, the Baire clas...
متن کاملLattice Embeddings for Abstract Bounded Reducibilities
We give an abstract account of resource-bounded reducibilities as exemplified by the polynomially timeor logarithmically space-bounded reducibilities of Turing, truth-table, and many-one type. We introduce a small set of axioms that are satisfied for most of the specific resourcebounded reducibilities appearing in the literature. Some of the axioms are of a more algebraic nature, such as the re...
متن کاملLipschitz and uniformly continuous Reducibilities on Ultrametric polish spaces
We analyze the reducibilities induced by, respectively, uniformly continuous, Lipschitz, and nonexpansive functions on arbitrary ultrametric Polish spaces, and determine whether under suitable set-theoretical assumptions the induced degree-structures are well-behaved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 22 شماره
صفحات -
تاریخ انتشار 2012